A new efficient k-out-of-n Oblivious Transfer protocol
نویسندگان
چکیده
This paper presents a new efficient protocol for k-out-of-n oblivious transfer which is a generalization of Parakh's 1-out-of-2 oblivious transfer protocol based on Diffie-Hellman key exchange. In the proposed protocol, the parties involved generate Diffie-Hellman keys obliviously and then use them for oblivious transfer of secrets.
منابع مشابه
Efficient k-out-of-n oblivious transfer protocol
A new k-out-of-n oblivious transfer protocol is presented in this paper. The communication cost of our scheme are n+1 messages of sender to receiver and k messages from the receiver to sender. To the best knowledge of the authors, the communication complexity of our scheme is the least. Also, our scheme has a lower computation cost with (k+1)n modular exponentiations for sender and 3k modular e...
متن کاملEfficient k-out-of-n Oblivious Transfer Schemes
Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme allows a buyer to privately choose k out of n digital goods from a merchant without learning information about other n−k goods. In this paper, we propose several efficient two-round k-out-of-n oblivious transfer schemes, in whic...
متن کاملMicrosoft Word - 51_68-C-카드_0927-OK_ _대만 Copyright Accepted_ 0915 A New Design of Oblivious Transfer for Private Informatio
In a t-out-n oblivious transfer, the receiver can only receive t messages out of n messages sent by the sender; and the sender has no idea about which ones have been received. Majority of the existing of previous efficient oblivious transfer schemes require t calls of 1-out-n oblivious transfer to construct the t-out-n oblivious transfer. Its computational requirements and bandwidth consumption...
متن کاملGeneralizing Efficient Multiparty Computation
We focus on generalizing constructions of Batch Single-Choice Cut-And-Choose Oblivious Transfer and Multi-sender k-out-of-n Oblivious Transfer, which are at the core of efficient secure computation constructions proposed by Lindell et al. and the IPS compiler. Our approach consists in showing that such primitives can be based on a much weaker and simpler primitive called Verifiable Oblivious Tr...
متن کاملEfficient reduction of 1 out of n oblivious transfers in random oracle model
We first present a protocol which reduces 1-out-of-n oblivious transfer OTl to 1out-of-n oblivious transfer OTm for n > 2 in random oracle model, and show that the protocol is secure against malicious sender and semi-honest receiver. Then, by employing a cut-and-choose technique, we obtain a variant of the basic protocol which is secure against a malicious receiver.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0909.2852 شماره
صفحات -
تاریخ انتشار 2009